منابع مشابه
Periodicity Forcing Words
The Dual Post Correspondence Problem asks, for a given word α, if there exists a non-periodic morphism g and an arbitrary morphism h such that g(α) = h(α). Thus α satisfies the Dual PCP if and only if it belongs to a non-trivial equality set. Words which do not satisfy the Dual PCP are called periodicity forcing, and are important to the study of word equations, equality sets and ambiguity of m...
متن کاملPeriodicity Algorithms for Partial Words
In this paper we investigate several periodicity-related algorithms for partial words. First, we show that all periods of a partial word of length n are determined in O(n logn), and provide algorithms and data structures that help us answer in constant time queries regarding the periodicity of their factors. For this we need a O(n2) preprocessing time and a O(n) updating time, whenever the word...
متن کاملWords with unbounded periodicity complexity
If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurrent words with the peri-odicity complexity arbitrarily high at infinitely many positions.
متن کاملOn the Frequency and Periodicity of Infinite Words On the Frequency and Periodicity of Infinite Words
This work contributes to two aspects of the understanding of infinite words: the frequency of letters in a morphic sequence and periodicity considerations on infinite words. First, we develop a necessary and sufficient criteria for the existence of the frequency of a letter in a morphic sequence, and give some applications of this result. We show that the frequencies of all letters exist in pur...
متن کاملPeriodicity and unbordered segments of words
In 1979 Ehrenfeucht and Silberger published an article [9] where the relationship between the length of a word and the maximum length of its unbordered factors (segments) was for the first time investigated. Periodicity and borderedness are two basic properties of words that play a rôle in many areas of computer science such as string searching algorithms [13, 3, 7], data compression [20, 6], a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.08.033